Positivity-preserving H∞ model reduction for positive systems
نویسندگان
چکیده
This paper is concerned with the model reduction of positive systems. For a given stable positive system, our attention is focused on the construction of a reduced-order model in such a way that the positivity of the original system is preserved and the error system is stable with a prescribed H1 performance. Based upon a system augmentation approach, a novel characterization on the stability with H1 performance of the error system is rst obtained in terms of linear matrix inequality (LMI). Then, a necessary and su¢ cient condition for the existence of a desired reduced-order model is derived accordingly. A signi cance of the proposed approach is that the reduced-order system matrices can be parametrized by a positive de nite matrix with exible structure, which is fully independent of the Lyapunov matrix; thus, the positivity constraint on the reduced-order system can be readily embedded in the model reduction problem. Furthermore, iterative LMI approaches with primal and dual forms are developed to solve the positivity-preserving H1 model reduction problem. Finally, a compartmental network is provided to show the e¤ectiveness of the proposed techniques.
منابع مشابه
Positivity Preserving Balanced Truncation for Descriptor Systems
We propose a model reduction method for positive systems that ensures the positivity of the reduced-order model. In the standard as well as in the descriptor case, for continuous-time and discrete-time systems, our approach is based on constructing diagonal solutions of Lyapunov inequalities. These are linear matrix inequalities (LMIs), which are shown to be feasible. Positivity and stability a...
متن کاملPositivity-preserving nonstandard finite difference Schemes for simulation of advection-diffusion reaction equations
Systems in which reaction terms are coupled to diffusion and advection transports arise in a wide range of chemical engineering applications, physics, biology and environmental. In these cases, the components of the unknown can denote concentrations or population sizes which represent quantities and they need to remain positive. Classical finite difference schemes may produce numerical drawback...
متن کاملSemantic Preserving Data Reduction using Artificial Immune Systems
Artificial Immune Systems (AIS) can be defined as soft computing systems inspired by immune system of vertebrates. Immune system is an adaptive pattern recognition system. AIS have been used in pattern recognition, machine learning, optimization and clustering. Feature reduction refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encoun...
متن کاملA family of positive nonstandard numerical methods with application to Black-Scholes equation
Nonstandard finite difference schemes for the Black-Scholes partial differential equation preserving the positivity property are proposed. Computationally simple schemes are derived by using a nonlocal approximation in the reaction term of the Black-Scholes equation. Unlike the standard methods, the solutions of new proposed schemes are positive and free of the spurious oscillations.
متن کاملAn efficient nonstandard numerical method with positivity preserving property
Classical explicit finite difference schemes are unsuitable for the solution of the famous Black-Scholes partial differential equation, since they impose severe restrictions on the time step. Furthermore, they may produce spurious oscillations in the solution. We propose a new scheme that is free of spurious oscillations and guarantees the positivity of the solution for arbitrary stepsizes. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Automatica
دوره 47 شماره
صفحات -
تاریخ انتشار 2011